Iterative total least-squares image reconstruction algorithm for optical tomography by the conjugate gradient method.

نویسندگان

  • W Zhu
  • Y Wang
  • Y Yao
  • J Chang
  • H L Graber
  • R L Barbour
چکیده

We present an iterative total least-squares algorithm for computing images of the interior structure of highly scattering media by using the conjugate gradient method. For imaging the dense scattering media in optical tomography, a perturbation approach has been described previously [Y. Wang et al., Proc. SPIE 1641, 58 (1992); R. L. Barbour et al., in Medical Optical Tomography: Functional Imaging and Monitoring (Society of Photo-Optical Instrumentation Engineers, Bellingham, Wash., 1993), pp. 87-120], which solves a perturbation equation of the form W delta x = delta I. In order to solve this equation, least-squares or regularized least-squares solvers have been used in the past to determine best fits to the measurement data delta I while assuming that the operator matrix W is accurate. In practice, errors also occur in the operator matrix. Here we propose an iterative total least-squares (ITLS) method that minimizes the errors in both weights and detector readings. Theoretically, the total least-squares (TLS) solution is given by the singular vector of the matrix [W/ delta I] associated with the smallest singular value. The proposed ITLS method obtains this solution by using a conjugate gradient method that is particularly suitable for very large matrices. Simulation results have shown that the TLS method can yield a significantly more accurate result than the least-squares method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conjugate-gradient preconditioning methods for shift-variant PET image reconstruction

Gradient-based iterative methods often converge slowly for tomographic image reconstruction and image restoration problems, but can be accelerated by suitable preconditioners. Diagonal preconditioners offer some improvement in convergence rate, but do not incorporate the structure of the Hessian matrices in imaging problems. Circulant preconditioners can provide remarkable acceleration for inve...

متن کامل

Conjugate-Gradient Preconditioning Methods For Shift-Variant PET Image Reconstruction - Image Processing, IEEE Transactions on

Gradient-based iterative methods often converge slowly for tomographic image reconstruction and image restoration problems, but can be accelerated by suitable preconditioners. Diagonal preconditioners offer some improvement in convergence rate, but do not incorporate the structure of the Hessian matrices in imaging problems. Circulant preconditioners can provide remarkable acceleration for inve...

متن کامل

Preconditioning Methods for Shift-Variant Image Reconstruction

Preconditioning methods can accelerate the convergence of gradient-based iterative methods for tomographic image reconstruction and image restoration. Circulant preconditioners have been used extensively for shiftinvariant problems. Diagonal preconditioners offer some improvement in convergence rate, but do not incorporate the structure of the Hessian matrices in imaging problems. For inverse p...

متن کامل

An adaptive multigrid algorithm for region of interest diffuse optical tomography

Due to diffuse nature of light photons, Diffuse Optical Tomography (DOT) image reconstruction is a challenging 3D problem with a relatively large number of unknowns and limited measurements. AS a result, the computational complexity of the existing DOT image reconstruction algorithms remains prohibitive. In this work, we investigate an adaptive multigrid approach to improve the computational ef...

متن کامل

A Fast Iterative Shrinkage-Thresholding Algorithm for Electrical Resistance Tomography

Image reconstruction in Electrical Resistance Tomography (ERT) is an ill-posed nonlinear inverse problem. Considering the influence of the sparse measurement data on the quality of the reconstructed image, the l1 regularized least-squares program (l1 regularized LSP), which can be cast as a second order cone programming problem, is introduced to solve the inverse problem in this paper. A normal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of the Optical Society of America. A, Optics, image science, and vision

دوره 14 4  شماره 

صفحات  -

تاریخ انتشار 1997